Markovian bounds on functions of finite Markov chains
نویسندگان
چکیده
In this paper, we obtain Markovian bounds on a function of a homogeneous discrete time Markov chain. For deriving such bounds, we use well known results on stochastic majorization of Markov chains and the Rogers-Pitman’s lumpability criterion. The proposed method of comparison between functions of Markov chains is not equivalent to generalized coupling method of Markov chains although we obtain same kind of majorization. We derive necessary and sufficient conditions for existence of our Markovian bounds. We also discuss the choice of the geometric invariant related to the lumpability condition that we use.
منابع مشابه
Convergence of ODE approximations and bounds on performance models in the steady-state
We present a limiting convergence result for differential equation approximations of continuous-time Markovian performance models in the stationary (steady-state) regime. This extends existing results for convergence up to some finite time. We show how, for a large class of performance models, this result can be inexpensively exploited to make strong statements about the stationary behaviour of...
متن کاملANALYSIS OF FINITE BUFFER RENEWAL INPUT QUEUE WITH BALKING AND MARKOVIAN SERVICE PROCESS
This paper presents the analysis of a renewal input finite buffer queue wherein the customers can decide either to join the queue with a probability or balk. The service process is Markovian service process ($MSP$) governed by an underlying $m$-state Markov chain. Employing the supplementary variable and imbedded Markov chain techniques, the steady-state system length distributions at pre...
متن کاملNon-Asymptotic and Asymptotic Analyses of Information Processing on Markov Chains
We study finite-length bounds for source coding with side information for Markov sources and channel coding for channels with conditional Markovian additive noise. For this purpose, we propose two criteria for finite-length bounds. One is the asymptotic optimality and the other is the efficient computability of the bound. Then, we derive finite-length upper and lower bounds for coding length in...
متن کاملFinite-Length Bounds for Joint Source-Channel Coding with Markovian Source and Additive Channel Noise to Achieve Large and Moderate Deviation Bounds
We derive novel upper and lower finite-length bounds of the error probability in joint source-channel coding when the source obeys the ergodic Markov process and the channel is a Markovian additive channel or a Markovian conditional additive channel. These bounds achieve the tight bounds in the large and moderate deviation regimes. Index Terms Markov chain, joint source-channel coding, finite-l...
متن کاملEmpirical Bayes Estimation in Nonstationary Markov chains
Estimation procedures for nonstationary Markov chains appear to be relatively sparse. This work introduces empirical Bayes estimators for the transition probability matrix of a finite nonstationary Markov chain. The data are assumed to be of a panel study type in which each data set consists of a sequence of observations on N>=2 independent and identically dis...
متن کامل